Weak Kleene Algebra is Sound and (Possibly) Complete for Simulation
نویسنده
چکیده
We show that the axioms of Weak Kleene Algebra (WKA) are sound and complete for the theory of regular expressions modulo simulation equivalence, assuming their completeness for monodic trees (as conjectured by Takai and Furusawa).
منابع مشابه
Weak Concurrent Kleene Algebra with Application to Algebraic Verification
We propose a generalisation of concurrent Kleene algebra [5] that can take account of probabilistic effects in the presence of concurrency. The algebra is proved sound with respect to a model of automata modulo a variant of rooted η-simulation equivalence. Applicability is demonstrated by algebraic treatments of two examples: algebraic may testing and Rabin’s solution to the choice coordination...
متن کاملQuantitative methods in security and safety critical applications (NII Shonan Meeting 2012-10)
This talk shows how Markov Automata (MA) can be used to provide a truly simple semantics of Generalized Stochastic Petri Nets (GSPNs), a popular model in performance and dependability analysis that exists for more than 25 years. In fact, our approach works for all GSPNs. No restrictions are imposed on the concurrent/conflicting enabledness of immediate transitions. This contrasts with existing ...
متن کاملOmega Algebras and Regular Equations
We study a weak variant of omega algebra, where one of the usual star induction axioms is absent, in the context of recursive regular equations. We present abstract conditions for explicitly defining the omega operation and use them for proving an algebraic variant of Arden’s rule for solving such equations. We instantiate these results in concrete models—languages, traces and relations—showing...
متن کاملProbabilistic Concurrent Kleene Algebra
We provide an extension of concurrent Kleene algebras to account for probabilistic properties. The algebra yields a unified framework containing nondeterminism, concurrency and probability and is sound with respect to the set of probabilistic automata modulo probabilistic simulation. We use the resulting algebra to generalise the algebraic formulation of a variant of Jones’ rely/guarantee calcu...
متن کاملKleene Algebra Modulo Theories
Kleene algebras with tests (KATs) o er sound, complete, and decidable equational reasoning about regularly structured programs. Since NetKAT demonstrated how well various extensions of KATs apply to computer networks, interest in KATs has increased greatly. Unfortunately, extending a KAT to a particular domain by adding custom primitives, proving its equational theory sound and complete, and co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0910.1028 شماره
صفحات -
تاریخ انتشار 2009